package algorithms.leecode;


import cn.hutool.core.lang.tree.TreeNode;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

public class offer32 {
    public int[] levelOrder(TreeNode root) {
    List<Integer> list = new ArrayList<>();
    int[] res = new int[list.size()];
        for (int i = 0; i < list.size(); i++) {
            res[i] = list.get(i);
        }
        return res;
    }


}
